package 树.二叉树;

import java.util.Arrays;
public class BSTreeTest {
    public static void main(String[] args) {
        BSTree bsTree = new BSTree();
        int[] arr = new int[]{41 , 58 , 50 , 60 , 42 , 53 , 59 , 63};
        for (int i:arr
             ){
            bsTree.add(i);
        }
        System.out.println(bsTree.findMax());
        System.out.println(bsTree.findMin());
        bsTree.remove(58);
        System.out.println(bsTree.toString());
    }
}

